Generalizing Temporal Controllability

نویسندگان

  • Michael D. Moffitt
  • Martha E. Pollack
چکیده

In this paper, we focus on extending the expressive power of constraint-based temporal reasoning formalisms. We begin with the well-known Simple Temporal Problem with Uncertainty, and incorporate three extensions: prior observability, in which the values of uncontrollable events become known prior to their actual occurrence; partial shrinkage, in which an observation event triggers the reduction of a contingent temporal interval; and a generalization of partial shrinkage to requirement links, making it possible to express certain types of uncertainty that may arise even when the time points in a problem are themselves fully controllable. We describe levels of controllability in the resulting formalism, the Generalized STPU, and relate this formalism to related developments in disjunctive temporal reasoning. Throughout, we motivate our approach with simple, real-world examples that illustrate the limitations of existing formalisms and the flexibility of our proposed extensions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Disjunctive Temporal Planning with Uncertainty

Driven by planning problems with both disjunctive constraints and contingency, we define the Disjunctive Temporal Problem with Uncertainty (DTPU), an extension of the DTP that includes contingent events. Generalizing existing work on Simple Temporal Problems with Uncertainty, we divide the time-points into controllable and uncontrollable classes, and propose varying notions of controllability t...

متن کامل

Robust Execution of Plans for Human-Robot Teams

Humans and robots working together can efficiently complete tasks that are very difficult for either to accomplish alone. To collaborate fluidly, robots must recognize the humans’ intentions and adapt to their actions appropriately. Pike is an online executive introduced previously in the literature that unifies intent recognition and plan adaptation for temporally flexible plans with choice. W...

متن کامل

Controllability of temporal networks: An analysis using higher-order networks

In this manuscript, we show how higher-order graphical models can be applied to study the controllability of networked systems with dynamic topologies. Studying empirical data on temporal networks, we specifically show that the order correlations in the activation sequence of links can both increase or reduce the time needed to achieve full controllability. We then demonstrate how spectral prop...

متن کامل

Controllability of linear differential-algebraic systems - a survey

Different concepts related to controllability of differential-algebraic equations are described. The class of systems considered consists of linear differential-algebraic equations with constant coefficients. Regularity, which is, loosely speaking, a concept related to existence and uniqueness of solutions for any inhomogeneity, is not required in this article. The concepts of impulse controlla...

متن کامل

Dynamic Control Of Plans With Temporal Uncertainty

Certain planning systems that deal with quantitative time constraints have used an underlying Simple Temporal Problem solver to ensure temporal consistency of plans. However, many applications involve processes of uncertain duration whose timing cannot be controlled by the execution agent. These cases require more complex notions of temporal feasibility. In previous work, various “controllabili...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007